The Application of Promela and Spin in the BOS Project (abstract)

نویسنده

  • Pim Kars
چکیده

After a short introduction to the BOS project, we discuss the \why, what and how" of the use of formal methods in the project, some recent experience using Promela/Spin and re ections on the pragmatics of validation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combining Formal Methods: An Exercise in Integration

Formal methods can rarely capture all the dimensions of a software project. Diierent aspects of a project are thus typically formalized separately, with little or no integration. We study here the integration of a formal speciication methods and a validation method. The methods that we use are Larch and PROMELA/spin. Larch is an algebraic speciication method, specialized in the speciication of ...

متن کامل

Model Checking CoreASM Specifications

In this paper we present an approach to model checking abstract state machines using the Spin model checker. We give an algorithm for automatically transforming ASM specifications written in CoreASM [1] into Promela specifications. Though an algorithm for translating ASMs into Promela has already been presented in [2], our method supports a more powerful ASM language, including support for n-ar...

متن کامل

Verifying Semantic Relations in SPIN

Spine is an experimental veri cation system based on Promela/Spin version 1.5.7. Spin is a general veri cation tool for proving correctness properties of concurrent/distributed systems speci ed in the CSP-like modeling language Promela [8, 9]. This extended abstract describing the Spine system and its foundations assumes familiarity with Promela/Spin. The Spine system extends Spin with `limited...

متن کامل

Type inference and strong static type checking for Promela

The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protocols. Model checking with SPIN involves reasoning about a system via an abstract Promela specification, thus the technique depends critically on the soundness of this specification. Promela includes a rich set of data ty...

متن کامل

Applying Model Checking in Java Verification

This paper presents our experiences in applying the Java PathFinder (Jpf), a recently developed Java to Promela translator, in the search for synchronization bugs in a Chinese Chess game server application written in Java. We give an overview of Jpf and the subset of Java that it supports and describe an initial effort to abstract and analyze the game server. Finally, we evaluate the results of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996